 |
Hasse diagram Totally Explained
|
|  |
|
NEW! |
All the latest news in the worlds of
computer gaming,
entertainment,
the environment,
finance,
health,
politics,
science,
stocks & shares,
technology
and much,
much,
more.
|
Everything about Hasse Diagram totally explainedIn the mathematical discipline known as order theory, a Hasse diagram ( HAHS uh), named after Helmut Hasse (1898–1979)) is a simple picture of a finite partially ordered set, forming a drawing of the transitive reduction of the partial order. Concretely, one represents each element of S as a vertex on the page and draws a line segment or curve that goes upward from x to y if x < y, and there's no z such that x < z < y. In this case, we say y covers x, or y is an immediate successor of x. Furthermore it's required that the vertices are positioned in such a way that each curve meets exactly two vertices: its two endpoints. Any such diagram (given that the vertices are labeled) uniquely determines a partial order, and any partial order has a unique transitive reduction, but there are many possible placements of elements in the plane, resulting in different Hasse diagrams for a given order that may have widely varying appearances.
Sometimes, the phrase "Hasse diagram" is used to refer to the transitive reduction as an abstract directed acyclic graph, independently of any drawing of that graph, but we eschew that usage here.
Examples
|
|